package leetcode;

import java.util.List;

/**
 * @创建人 MBY381
 * @创建时间 2022/4/13 21:11
 * @描述 暂无
 */
public class Solution200 {
    void dfs(char[][] grid, int r, int c) {
        int nr = grid.length;
        int nc = grid[0].length;

        if (r < 0 || c < 0 || r >= nr || c >= nc || grid[r][c] == '0') {
            return;
        }

        grid[r][c] = '0';
        dfs(grid, r - 1, c);
        dfs(grid, r + 1, c);
        dfs(grid, r, c - 1);
        dfs(grid, r, c + 1);
    }

    public int numIslands(char[][] grid) {
        if (grid == null || grid.length == 0) {
            return 0;
        }

        int nr = grid.length;
        int nc = grid[0].length;
        int num_islands = 0;
        for (int r = 0; r < nr; ++r) {
            for (int c = 0; c < nc; ++c) {
                if (grid[r][c] == '1') {
                    ++num_islands;
                    dfs(grid, r, c);
                }
            }
        }

        return num_islands;
    }
    public static void main(String[] args) {

    }



    public static boolean addWithJudge(List<int[]> li, char[][] grid, int x, int y) {
        if(grid==null){
            return false;
        }
        boolean tag=false;
        int lenX=grid[0].length;
        int lenY=grid.length;
        if(x>0){
            if(grid[y][x-1]=='1'){
                li.add(new int[]{x-1,y});
            }
            tag=true;
        }
        if(y>0){
            if(grid[y-1][x]=='1'){
                li.add(new int[]{x,y-1});
            }
            tag=true;
        }
        if(x<lenX-1){
            if(grid[y][x+1]=='1'){
                li.add(new int[]{x+1,y});
            }
            tag=true;
        }
        if(y<lenY-1){
            if(grid[y+1][x]=='1'){
                li.add(new int[]{x,y+1});
            }
            tag=true;
        }
    return tag;
    }
}
